On Generalization of Voronoi Diagram
نویسندگان
چکیده
Voronoi diagram is a typical partitioning of plane according to number given points on the referred as generators, based Euclidean distances from points. In current study, generalization such voronoi discussed viewpoint various consideration distance. On basis discrete decomposition approach, we take into account distance metrics other than conventional The existence pathway network shorten gives space non-uniformity in We propose an approach for under this non-uniformity. Different weights generators well evaluations are also taken consideration. A calculated examples demonstrate significance these conditions obtained diagrams.
منابع مشابه
Vesicle computers: Approximating Voronoi diagram on Voronoi automata
Irregular arrangements of vesicles filled with excitable and precipitating chemical systems are imitated by Voronoi automata — finite-state machines defined on a planar Voronoi diagram. Every Voronoi cell takes four states: resting, excited, refractory and precipitate. A resting cell excites if it has at least one excited neighbour; the cell precipitates if a ratio of excited cells in its neigh...
متن کاملTime - Based Voronoi Diagram ∗
We consider a variation of Voronoi diagram, or time-based Voronoi diagram, for a set S of points in the presence of transportation lines or highways in the plane. A shortest time-distance path from a query point to any given point in S is a path that takes the least travelling time. The travelling speeds and hence travelling times of the subpaths along the highways and in the plane are differen...
متن کاملRounding Voronoi Diagram
Computational geometry classically assumes real-number arithmetic which does not exist in actual computers. A solution consists in using integer coordinates for data and exact arithmetic for computations. This approach implies that if the results of an algorithm are the input of another, these results must be rounded to match this hypothesis of integer coordinates. In this paper, we treat the c...
متن کاملOn the Farthest Line-Segment Voronoi Diagram
The farthest line-segment Voronoi diagram shows properties surprisingly different than the farthest point Voronoi diagram: Voronoi regions may be disconnected and they are not characterized by convexhull properties. In this paper we introduce the farthest line-segment hull, a cyclic structure that relates to the farthest line-segment Voronoi diagram similarly to the way an ordinary convex hull ...
متن کاملVoronoi diagram generation on the ellipsoidal earth
Voronoi diagram on the earth surface is a powerful tool to study spatial proximity at continental or global scale. However, its computation remains challenging because geospatial features have complex shapes. This paper presents a raster-based algorithm to generate Voronoi diagrams on earth's surface. The algorithm approximates the exact point-to-point geographical distances using the cell-to-c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Shisutemu Seigyo Jo?ho? Gakkai ronbunshi
سال: 2021
ISSN: ['1342-5668', '2185-811X']
DOI: https://doi.org/10.5687/iscie.34.173